منابع مشابه
Quasi-cyclic LDPC codes with high girth
The LDPC codes are codes that approach optimal decoding performances, with an acceptable decoding computational cost ([1, 2, 3]). In this paper we present a class of quasi-cyclic LDPC codes and we show that we are able to guarantee some relevant properties of the codes. Experimentally, their decoding performance is comparable with the performance obtained by random LDPC codes. Traditionally, co...
متن کاملon the girth of tanner (3,7) quasi-cyclic ldpc codes
s. kim et al. have been analyzed the girth of some algebraically structured quasi-cyclic (qc) low-density parity-check (ldpc) codes, i.e. tanner $(3,5)$ of length $5p$, where $p$ is a prime of the form $15m+1$. in this paper, by extension this method to tanner $(3,7)$ codes of length $7p$, where $p$ is a prime of the form $21m+ 1$, the girth values of tanner $(3,7...
متن کاملThe Performance of LDPC codes with Large Girth
We experiment with variations of a method for constructing low-density paritycheck codes to investigate the effect on decoding performance under the sumproduct algorithm. The method uses circulant permutation matrices or affine permutation matrices as building blocks. We have developed an algorithm to choose these matrices so as to maximize the girth of the parity-check matrix. Substantial perf...
متن کاملThe design of structured regular LDPC codes with large girth
This paper introduces three new classes of structured regular (n, 2, k) LDPC codes with girth 12, 16, and 20, respectively. These codes are systematically constructed, well structured, and have uniform row and column weights, which make them able to greatly simplify the implementation of LDPC coders. Their large girth improves their decoding performance. Simulation results compare their bit err...
متن کاملGirth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths
A method to construct girth-12 (3,L) quasi-cyclic lowdensity parity-check (QC-LDPC) codes with all lengths larger than a certain given number is proposed, via a given girth-12 code subjected to some constraints. The lengths of these codes can be arbitrary integers of the form LP, provided that P is larger than a tight lower bound determined by the maximal element within the exponent matrix of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hans Journal of Wireless Communications
سال: 2014
ISSN: 2163-3983,2163-3991
DOI: 10.12677/hjwc.2014.41003